The coherence of Łukasiewicz assessments is NP-complete

The coherence of Lukasiewicz assessments is NP-complete

Overloading is NP - complete

We show that overloading is NP-complete. This solves exercise 6.25 in the 1986 version of the Dragon book.

Mastermind is NP-Complete

In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...

BLOCKSUM is NP-Complete

SUMMARY BlockSum, also known as KeisanBlock in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BlockSum has a solution or not is NP-complete.

Tetravex is NP-complete

TETRAVEX is a widely played one person computer game in which you are given n2 unit tiles, each edge of which is labelled with a number. The objective is to place each tile within a n by n square such that all neighbouring edges are labelled with an identical number. Unfortunately, playing TETRAVEX is computationally hard. More precisely, we prove that deciding if there is a tiling of the TETRA...